Phutball Endgames are Hard
نویسندگان
چکیده
We show that, in John Conway’s board game Phutball (or Philosopher’s Football), it is NP-complete to determine whether the current player has a move that immediately wins the game. In contrast, the similar problems of determining whether there is an immediately winning move in checkers, or a move that kings a man, are both solvable in polynomial time.
منابع مشابه
Phutball is PSPACE-hard
We consider the n × n game of Phutball. It is shown that, given an arbitrary position of stones on the board, it is a PSPACE-hard problem to determine whether the specified player can win the game, regardless of the opponent’s choices made during the game.
متن کاملA Parallel Endgame
Numerical algebraic geometry is the area devoted to the solution and manipulation of polynomial systems by numerical methods, which are mainly based on continuation. Due to the extreme intrinsic parallelism of continuation, polynomial systems may be successfully dealt with that are much larger than is possible with other methods. Singular solutions require special numerical methods called endga...
متن کاملAmazons is PSPACE-complete
Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a useful platform for both game-theoretic study and AI games research. Buro [2] showed that simple Amazons endgames are NP-equivalent, leaving the complexity of the general case as an open problem. We settle this problem, by showing that deciding the outcome of an n×n Amazon...
متن کاملMultilinear Algebra and Chess Endgames
This article has three chief aims: (1) To show the wide utility of multilinear algebraic formalism for high-performance computing. (2) To describe an application of this formalism in the analysis of chess endgames, and results obtained thereby that would have been impossible to compute using earlier techniques, including a win requiring a record 243 moves. (3) To contribute to the study of the ...
متن کاملSimple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs
Amazons is a young board game with simple rules and a high branching factor, which makes it a suitable test-bed for planning research. This paper considers the computational complexity of amazons puzzles and restricted amazons endgames. We rst prove the NP{ completeness of the Hamilton circuit problem for cubic subgraphs of the integer grid. This result is then used to show that solving amazons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cs.CC/0008025 شماره
صفحات -
تاریخ انتشار 2000